Probabilistic Imperative Programming: a Rigorous Approach
نویسندگان
چکیده
Recent work has extended Kozen's probabilistic semantics 8, 9] to include demonic nondeterminism both at the operational 5] and the logical level 12]. That makes it now possible in principle to treat probabilistic program development with the same standards of rigour that apply, when appropriate, to imperative programming 3]. In this report we treat several practical aspects of the new models, not discussed in their more theoretical presentations 5, 12]: a game-like interpretation of probabilistic and demonic choice acting jointly; the intuition behind the probabilistic`healthiness conditions' for predicate transformers, linking them to standard probability theory; and the use of predicate transformers to measure expected eeciency.
منابع مشابه
Stochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملDeveloping and Reasoning About Probabilistic Programs in pGCL
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as an intellectual framework for rigorous reasoning about imperative sequential programs; one of its novelties was that it contained explicit “demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nonde...
متن کاملMeasure Transformer Semantics for Bayesian Machine Learning
The Bayesian approach to machine learning amounts to computing posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and a set of observations of variables. There is a trend in machine learning towards expressing Bayesian models as probabilistic programs. As a foundation for this kind of programming, we propose a ...
متن کاملProbabilistic Relational Hoare Logics for Computer-Aided Security Proofs
The provable security paradigm originates from the work of Goldwasser and Micali [10] and plays a central role in modern cryptography. Since its inception, the focus of provable security has gradually shifted towards practice-oriented provable security [4]. The central goal of practice-oriented provable security is to develop and analyze efficient cryptographic systems that can be used for prac...
متن کاملMulti-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کامل